Trivariate monomial complete intersections and plane partitions
نویسندگان
چکیده
منابع مشابه
Trivariate Monomial Complete Intersections and Plane Partitions
We consider the homogeneous components Ur of the map on R = k[x, y, z]/(xA, yB , zC) that multiplies by x + y + z. We prove a relationship between the Smith normal forms of submatrices of an arbitrary Toeplitz matrix using Schur polynomials, and use this to give a relationship between Smith normal form entries of Ur. We also give a bijective proof of an identity proven by J. Li and F. Zanello e...
متن کاملMonomial Ideals, Almost Complete Intersections and the Weak Lefschetz Property
has maximal rank, i.e. it is injective or surjective. In this case, the linear form L is called a Lefschetz element of A. (We will often abuse notation and say that the corresponding ideal has the WLP.) The Lefschetz elements of A form a Zariski open, possibly empty, subset of (A)1. Part of the great interest in the WLP stems from the fact that its presence puts severe constraints on the possib...
متن کاملPartitions of Complete Geometric Graphs into Plane Trees
Consider the following open problem: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directions. First, we study the case of convex geometric graphs. It is well known that the complete convex graph K2n has a partition into n plane spanning trees. We characterise all such partitions. Second, we give a suffi...
متن کاملPlanar Graphs as Minimal Resolutions of Trivariate Monomial Ideals
We introduce the notion of rigid embedding in a grid surface, a new kind of plane drawing for simple triconnected planar graphs. Rigid embeddings provide methods to (1) find well-structured (cellular, here) minimal free resolutions for arbitrary monomial ideals in three variables; (2) strengthen the Brightwell–Trotter bound on the order dimension of triconnected planar maps by giving a geometri...
متن کاملPlane Partitions
Throughout our study of the enumeration of plane partitions we make use of bijective proofs to find generating functions. In particular, we consider bounded plane partitions, symmetric plane partitions and weak reverse plane partitions. Using the combinatorial interpretations of Schur functions in relation to semistandard Young tableaux, we rely on the properties of symmetric functions. In our ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Commutative Algebra
سال: 2011
ISSN: 1939-2346
DOI: 10.1216/jca-2011-3-4-459